An Imperfect String Matching Experience Using Deformed Fuzzy Automata
نویسندگان
چکیده
This paper presents a string matching experience using deformed fuzzy automata for the recognition of imperfect strings. We propose an algorithm based on a deformed fuzzy automaton that calculates a similarity value between strings having a non-limited number of edition errors. Different selections of the fuzzy operators for computing the deformed fuzzy automaton transitions allows to obtain different string similarity definitions. The selection of the parameters determining the deformed fuzzy automaton behavior is obtained via genetic algorithms.
منابع مشابه
Approximate String Matching by Fuzzy Automata
We explain new ways of constructing search algorithms using fuzzy sets and fuzzy automata. This technique can be used to search or match strings in special cases when some pairs of symbols are more similar to each other than the others. This kind of similarity can’t be handled by usual searching algorithms. We present sample situations, which would use this kind of searching. Then we define a f...
متن کاملSpace Complexity of Linear Time Approximate String Matching
Approximate string matching is a sequential problem and therefore it is possible to solve it using nite automata. Nondeterministic nite automata are constructed for string matching with k mismatches and k di erences. The corresponding deterministic nite automata are base for approximate string matching in linear time. Then the space complexity of both types of deterministic automata is calculat...
متن کاملMyhill-Nerode Fuzzy Congruences Corresponding to a General Fuzzy Automata
Myhill-Nerode Theorem is regarded as a basic theorem in the theories of languages and automata and is used to prove the equivalence between automata and their languages. The significance of this theorem has stimulated researchers to develop that on different automata thus leading to optimizing computational models. In this article, we aim at developing the concept of congruence in general fuzzy...
متن کاملShape recognition using fuzzy string-matching technique
Object recognition is a very important task in industrial applications. Attributed string matching is a well-known technique for pattern matching. The present paper proposes a fuzzy string-matching approach for two-dimensional object recognition. The fuzzy numbers are used to represent the edit costs. Therefore, the edit distances are also presented as fuzzy numbers. The attributed string-match...
متن کاملA space efficient bit-parallel algorithm for the multiple string matching problem
Finite (nondeterministic) automata are very useful building blocks in the field of string matching. This is particularly true in the case of multiple pattern matching, where the use of factor-based automata can reduce substantially the number of computational steps when the patterns have large common factors. Direct simulation of nondeterministic automata can be performed very efficiently using...
متن کامل